Counting Objects using Homogeneous Connected Components
نویسندگان
چکیده
منابع مشابه
Counting Models Using Connected Components
Recent work by Birnbaum & Lozinskii [1999] demonstrated that a clever yet simple extension of the well-known DavisPutnam procedure for solving instances of propositional satisfiability yields an efficient scheme for counting the number of satisfying assignments (models). We present a new extension, based on recursively identifying connected constraint-graph components, that substantially improv...
متن کاملGrouping Objects to Homogeneous Classes Satisfying Requisite Mass
Grouping datasets plays an important role in many scientific researches. Depending on data features and applications, different constrains are imposed on groups, while having groups with similar members is always a main criterion. In this paper, we propose an algorithm for grouping the objects with random labels, nominal features having too many nominal attributes. In addition, the size constra...
متن کاملObjects Counting Using Mark-Controlled Watershed Transform
This paper introduces the object counting using the mark controlled watershed transforms. Watershed transform is usually adopted for image segmentation in the area of image processing and image analysis because it always generates closed contours for each region in the original image. This method is good choice for image segmentation in the field of mathematical morphology. In this paper we are...
متن کاملCountable connected-homogeneous graphs
A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the countably infinite connectedhomogeneous graphs. We prove that if Γ is connected countably infinite and connected-homogeneous then Γ is isomorphic to one of: Lachlan and Woodrow’s ultrahomogeneous graphs; the generic bipartite graph...
متن کاملCounting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k − 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the probabilistic method, analyzing breadth-first search on the random graph G(k, p) for an appropriate edge probability p. Central is analysis of a random walk with fixed beginning and end which is tilted to the left.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/10590-5585